Search Results

Documents authored by Muggleton, Stephen H.

Found 2 Possible Name Variants:

Muggleton, Stephen H.

Document
DOI: 10.4230/DagRep.9.5.58
Approaches and Applications of Inductive Programming (Dagstuhl Seminar 19202)

Authors: Luc De Raedt, Richard Evans, Stephen H. Muggleton, and Ute Schmid

Published in: Dagstuhl Reports, Volume 9, Issue 5 (2019)

Abstract
In this report the program and the outcomes of Dagstuhl Seminar 19202 "Approaches and Applications of Inductive Programming" is documented. After a short introduction to the state of the art to inductive programming research, an overview of the introductory tutorials, the talks, program demonstrations, and the outcomes of discussion groups is given.
Cite as

Luc De Raedt, Richard Evans, Stephen H. Muggleton, and Ute Schmid. Approaches and Applications of Inductive Programming (Dagstuhl Seminar 19202). In Dagstuhl Reports, Volume 9, Issue 5, pp. 58-88, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@Article{deraedt_et_al:DagRep.9.5.58,
  author =	{De Raedt, Luc and Evans, Richard and Muggleton, Stephen H. and Schmid, Ute},
  title =	{{Approaches and Applications of Inductive Programming (Dagstuhl Seminar 19202)}},
  pages =	{58--88},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2019},
  volume =	{9},
  number =	{5},
  editor =	{De Raedt, Luc and Evans, Richard and Muggleton, Stephen H. and Schmid, Ute},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.9.5.58},
  URN =		{urn:nbn:de:0030-drops-113810},
  doi =		{10.4230/DagRep.9.5.58},
  annote =	{Keywords: Enduser programming, Explainable AI, Human-like computing, Inductive logic programming, Probabilistic programming}
}
Document
DOI: 10.4230/DagRep.7.9.86
Approaches and Applications of Inductive Programming (Dagstuhl Seminar 17382)

Authors: Ute Schmid, Stephen H. Muggleton, and Rishabh Singh

Published in: Dagstuhl Reports, Volume 7, Issue 9 (2018)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 17382 "Approaches and Applications of Inductive Programming". After a short introduction to the state of the art to inductive programming research, an overview of the introductory tutorials, the talks, program demonstrations, and the outcomes of discussion groups is given.
Cite as

Ute Schmid, Stephen H. Muggleton, and Rishabh Singh. Approaches and Applications of Inductive Programming (Dagstuhl Seminar 17382). In Dagstuhl Reports, Volume 7, Issue 9, pp. 86-108, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@Article{schmid_et_al:DagRep.7.9.86,
  author =	{Schmid, Ute and Muggleton, Stephen H. and Singh, Rishabh},
  title =	{{Approaches and Applications of Inductive Programming (Dagstuhl Seminar 17382)}},
  pages =	{86--108},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{7},
  number =	{9},
  editor =	{Schmid, Ute and Muggleton, Stephen H. and Singh, Rishabh},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.7.9.86},
  URN =		{urn:nbn:de:0030-drops-85909},
  doi =		{10.4230/DagRep.7.9.86},
  annote =	{Keywords: inductive program synthesis, inductive logic programming, probabilistic programming, end-user programming, human-like computing}
}
Document
DOI: 10.4230/DagRep.5.10.89
Approaches and Applications of Inductive Programming (Dagstuhl Seminar 15442)

Authors: José Hernández-Orallo, Stephen H. Muggleton, Ute Schmid, and Benjamin Zorn

Published in: Dagstuhl Reports, Volume 5, Issue 10 (2016)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 15442 "Approaches and Applications of Inductive Programming". After a short introduction to the state of the art to inductive programming research, an overview of the talks and the outcomes of discussion groups is given.
Cite as

José Hernández-Orallo, Stephen H. Muggleton, Ute Schmid, and Benjamin Zorn. Approaches and Applications of Inductive Programming (Dagstuhl Seminar 15442). In Dagstuhl Reports, Volume 5, Issue 10, pp. 89-111, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@Article{hernandezorallo_et_al:DagRep.5.10.89,
  author =	{Hern\'{a}ndez-Orallo, Jos\'{e} and Muggleton, Stephen H. and Schmid, Ute and Zorn, Benjamin},
  title =	{{Approaches and Applications of Inductive Programming (Dagstuhl Seminar 15442)}},
  pages =	{89--111},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{5},
  number =	{10},
  editor =	{Hern\'{a}ndez-Orallo, Jos\'{e} and Muggleton, Stephen H. and Schmid, Ute and Zorn, Benjamin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.5.10.89},
  URN =		{urn:nbn:de:0030-drops-57006},
  doi =		{10.4230/DagRep.5.10.89},
  annote =	{Keywords: inductive program synthesis, end-user programming, probabilistic programming, constraint programming, universal artificial intelligence, cognitive modeling}
}
Document
DOI: 10.4230/DagSemProc.07161.1
07161 Abstracts Collection – Probabilistic, Logical and Relational Learning - A Further Synthesis

Authors: Luc De Raedt, Thomas Dietterich, Lise Getoor, Kristian Kersting, and Stephen H. Muggleton

Published in: Dagstuhl Seminar Proceedings, Volume 7161, Probabilistic, Logical and Relational Learning - A Further Synthesis (2008)

Abstract
From April 14 – 20, 2007, the Dagstuhl Seminar 07161 ``Probabilistic, Logical and Relational Learning - A Further Synthesis'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Luc De Raedt, Thomas Dietterich, Lise Getoor, Kristian Kersting, and Stephen H. Muggleton. 07161 Abstracts Collection – Probabilistic, Logical and Relational Learning - A Further Synthesis. In Probabilistic, Logical and Relational Learning - A Further Synthesis. Dagstuhl Seminar Proceedings, Volume 7161, pp. 1-21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{deraedt_et_al:DagSemProc.07161.1,
  author =	{De Raedt, Luc and Dietterich, Thomas and Getoor, Lise and Kersting, Kristian and Muggleton, Stephen H.},
  title =	{{07161 Abstracts Collection – Probabilistic, Logical and Relational Learning - A Further Synthesis}},
  booktitle =	{Probabilistic, Logical and Relational Learning - A Further Synthesis},
  pages =	{1--21},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{7161},
  editor =	{Luc de Raedt and Thomas Dietterich and Lise Getoor and Kristian Kersting and Stephen H. Muggleton},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07161.1},
  URN =		{urn:nbn:de:0030-drops-13885},
  doi =		{10.4230/DagSemProc.07161.1},
  annote =	{Keywords: Artificial Intelligence, Uncertainty in AI, Probabilistic Reasoning, Knowledge Representation, Logic Programming, Relational Learning, Inductive Logic Programming, Graphical Models, Statistical Relational Learning, First-Order Logical and Relational Probabilistic Languages}
}
Document
DOI: 10.4230/DagSemProc.05051.1
05051 Abstracts Collection – Probabilistic, Logical and Relational Learning - Towards a Synthesis

Authors: Luc De Raedt, Tom Dietterich, Lise Getoor, and Stephen H. Muggleton

Published in: Dagstuhl Seminar Proceedings, Volume 5051, Probabilistic, Logical and Relational Learning - Towards a Synthesis (2006)

Abstract
From 30.01.05 to 04.02.05, the Dagstuhl Seminar 05051 ``Probabilistic, Logical and Relational Learning - Towards a Synthesis'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Luc De Raedt, Tom Dietterich, Lise Getoor, and Stephen H. Muggleton. 05051 Abstracts Collection – Probabilistic, Logical and Relational Learning - Towards a Synthesis. In Probabilistic, Logical and Relational Learning - Towards a Synthesis. Dagstuhl Seminar Proceedings, Volume 5051, pp. 1-27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{deraedt_et_al:DagSemProc.05051.1,
  author =	{De Raedt, Luc and Dietterich, Tom and Getoor, Lise and Muggleton, Stephen H.},
  title =	{{05051 Abstracts Collection – Probabilistic, Logical and Relational Learning - Towards a Synthesis}},
  booktitle =	{Probabilistic, Logical and Relational Learning - Towards a Synthesis},
  pages =	{1--27},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5051},
  editor =	{Luc De Raedt and Thomas Dietterich and Lise Getoor and Stephen H. Muggleton},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05051.1},
  URN =		{urn:nbn:de:0030-drops-4303},
  doi =		{10.4230/DagSemProc.05051.1},
  annote =	{Keywords: Statistical relational learning, probabilistic logic learning, inductive logic programming, knowledge representation, machine learning, uncertainty in artificial intelligence}
}
Document
DOI: 10.4230/DagSemProc.05051.2
05051 Executive Summary – Probabilistic, Logical and Relational Learning - Towards a Synthesis

Authors: Luc De Raedt, Tom Dietterich, Lise Getoor, and Stephen H. Muggleton

Published in: Dagstuhl Seminar Proceedings, Volume 5051, Probabilistic, Logical and Relational Learning - Towards a Synthesis (2006)

Abstract
A short report on the Dagstuhl seminar on Probabilistic, Logical and Relational Learning – Towards a Synthesis is given.
Cite as

Luc De Raedt, Tom Dietterich, Lise Getoor, and Stephen H. Muggleton. 05051 Executive Summary – Probabilistic, Logical and Relational Learning - Towards a Synthesis. In Probabilistic, Logical and Relational Learning - Towards a Synthesis. Dagstuhl Seminar Proceedings, Volume 5051, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{deraedt_et_al:DagSemProc.05051.2,
  author =	{De Raedt, Luc and Dietterich, Tom and Getoor, Lise and Muggleton, Stephen H.},
  title =	{{05051 Executive Summary – Probabilistic, Logical and Relational Learning - Towards a Synthesis}},
  booktitle =	{Probabilistic, Logical and Relational Learning - Towards a Synthesis},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5051},
  editor =	{Luc De Raedt and Thomas Dietterich and Lise Getoor and Stephen H. Muggleton},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05051.2},
  URN =		{urn:nbn:de:0030-drops-4121},
  doi =		{10.4230/DagSemProc.05051.2},
  annote =	{Keywords: Reasoning about Uncertainty, Relational and Logical Represenations, Statistical Relational Learning, Inductive Lgoic Programmign}
}

Muggleton, Stephen

Document
DOI: 10.4230/LIPIcs.ICLP.2010.172
Subsumer: A Prolog theta-subsumption engine

Authors: Jose Santos and Stephen Muggleton

Published in: LIPIcs, Volume 7, Technical Communications of the 26th International Conference on Logic Programming (2010)

Abstract
State-of-the-art theta-subsumption engines like Django (C) and Resumer2 (Java) are implemented in imperative languages. Since theta-subsumption is inherently a logic problem, in this paper we explore how to efficiently implement it in Prolog. theta-subsumption is an important problem in computational logic and particularly relevant to the Inductive Logic Programming (ILP) community as it is at the core of the hypotheses coverage test which is often the bottleneck of an ILP system. Also, since most of those systems are implemented in Prolog, they can immediately take advantage of a Prolog based theta-subsumption engine. We present a relatively simple (~1000 lines in Prolog) but efficient and general theta-subsumption engine, Subsumer. Crucial to Subsumer's performance is the dynamic and recursive decomposition of a clause in sets of independent components. Also important are ideas borrowed from constraint programming that empower Subsumer to efficiently work on clauses with up to several thousand literals and several dozen distinct variables. Using the notoriously challenging Phase Transition dataset we show that, cputime wise, Subsumer clearly outperforms the Django subsumption engine and is competitive with the more sophisticated, state-of-the-art, Resumer2. Furthermore, Subsumer's memory requirements are only a small fraction of those engines and it can handle arbitrary Prolog clauses whereas Django and Resumer2 can only handle Datalog clauses.
Cite as

Jose Santos and Stephen Muggleton. Subsumer: A Prolog theta-subsumption engine. In Technical Communications of the 26th International Conference on Logic Programming. Leibniz International Proceedings in Informatics (LIPIcs), Volume 7, pp. 172-181, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{santos_et_al:LIPIcs.ICLP.2010.172,
  author =	{Santos, Jose and Muggleton, Stephen},
  title =	{{Subsumer: A Prolog theta-subsumption engine}},
  booktitle =	{Technical Communications of the 26th International Conference on Logic Programming},
  pages =	{172--181},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-17-0},
  ISSN =	{1868-8969},
  year =	{2010},
  volume =	{7},
  editor =	{Hermenegildo, Manuel and Schaub, Torsten},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2010.172},
  URN =		{urn:nbn:de:0030-drops-25959},
  doi =		{10.4230/LIPIcs.ICLP.2010.172},
  annote =	{Keywords: Theta-subsumption, Prolog, Inductive Logic Programming}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact